Reconfigurable Fast Fourier Transform Architecture for Orthogonal Frequency Division Multiplexing Systems

نویسندگان

  • Konstantinos E. MANOLOPOULOS
  • Konstantinos G. NAKOS
  • Dionysios I. REISIS
  • Nikolaos G. VLASSOPOULOS
چکیده

The performance of the Fast Fourier Transform computation plays a crucial role in the overall operation of OFDM modems. A VLSI architecture realizing the FFT has to perform in real time, adapt to various data rates and accommodate support for power dissipation requirements. This paper presents a VLSI architecture for real time FFT processing. The design involves four (4) radix-4 and one (1) radix-2 processing elements with complex multipliers and can be configured in real time to accommodate FFT computations of length 16, 32, 64, 128 and 256. For further speeding up the entire algorithm, the design can include a technique for parallel accessing the memory banks of each processing element. The validity and the efficiency of the architecture have been shown by an example implementation on FPGAs with throughput: each 256-length FFT at 2.48 usec.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel radon-wavelet based OFDM system design and performance under different channel conditions

Finite Radon Transform mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energy compared with conventional Fast Fourier Transform based orthogonal frequency division multiplexing. It is also able to work as a good interleaver which significantly reduces the bit error rate. Due to its good orthogo...

متن کامل

FPGA Implementation of Inverse Fast Fourier Transform in Orthogonal Frequency Division Multiplexing Systems

In modern communication systems, Orthogonal Frequency Division Multiplexing (OFDM) systems are used to transmit with higher data rate and avoid Inter Symbol Interference (ISI). The OFDM transmitter and receiver contain Inverse Fast Fourier Transform (IFFT) and Fast Fourier Transform (FFT), respectively. The IFFT block provides orthogonality between adjacent subcarriers. The orthogonality makes ...

متن کامل

Design and Simulation of 64-Point FFT Using Radix-4 Algorithm for OFDM Applications

OFDM technology promises to be a key technique for achieving the high data capacity and spectral efficiency requirements for wireless communication systems in future. Fast Fourier transform (FFT) processing is one of the key procedures in popular orthogonal frequency division multiplexing (OFDM) communication systems. A parallel and pipelined Fast Fourier Transform (FFT) processor for use in th...

متن کامل

FPGA Implementation of FFT Algorithm for OFDM Based IEEE 802.16d (Fixed WiMAX) Communications

⎯The IEEE 802.16d communication standard uses orthogonal frequency division multiplexing (OFDM). In the widely used OFDM systems, the fast Fourier transform (FFT) and inverse fast Fourier transform pairs are used to modulate and demodulate the data constellation on the sub-carriers. In this paper, a high level implementation of a high performance FFT for OFDM modulator and demodulator is presen...

متن کامل

Design and Implementation of 32 Bit FFT using Radix-2 Algorithm

-Fast Fourier Transform (FFT) processing is one of the key procedures in popular Orthogonal Frequency Division Multiplexing (OFDM) communication systems. Structured pipeline architectures, low power consumption, high speed and reduced chip area are the main concerns in this VLSI implementation. In this paper, the efficient implementation of FFT/IFFT processor for OFDM applications is presented....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003